Heuristical Coding of String Transformations
نویسندگان
چکیده
As a part of a study on statistical grammar learning, the word inflection is investigated in this article. The word inflection is used to create different grammatical instances of the word. In this paper, the different coding alternatives to describe the strings and the string transformations are investigated. The proposed methods are tested on a natural language, the Hungarian language.
منابع مشابه
New Directions in Coding: From Statistical Physics to Quasigroup String Transformations
The last several years have witnessed major theoretical advances in communications and coding theory resulting in a new coding concept called codes on graphs. Codes on graphs, and specially their prime examples, low-density parity check (LDPC) codes and turbo codes is a research area of great current interest. In this paper we first overview the basic relation between codes on graph and spin sy...
متن کاملQuasigroup String Processing
Given a nite setA we consider quasigroup operations n on A and we use them to de ne transformations E n D n A A where A is the set of all nite strings with members from A We show that the mappings E n and D n have several useful properties suitable for many purposes in cryptography coding theory de ning and improving pseudo random generators
متن کاملLearning String Transformations From Examples
“Robert” and “Bob” refer to the same first name but are textually far apart. Traditional string similarity functions do not allow a flexible way to account for such synonyms, abbreviations and aliases. Recently, string transformations have been proposed as a mechanism to make matching robust to such variations. However, in many domains, identifying an appropriate set of transformations is chall...
متن کاملFirst-order Definable String Transformations
The connection between languages defined by computational models and logic for languages is well-studied. Monadic second-order logic and finite automata are shown to closely correspond to each-other for the languages of strings, trees, and partial-orders. Similar connections are shown for first-order logic and finite automata with certain aperiodicity restriction. Courcelle in 1994 proposed a w...
متن کاملGauge transformations on a D-brane in Vacuum String Field Theory
We study gauge transformations of the Hata-Kawano vector state on a D25-brane in the framework of vacuum string field theory. We show that among the infinite number of components of the polarization vector, all the components except one spacetime vector degree of freedom are gauge freedom, and give string field gauge transformations reproducing gauge transformations of the constant modes of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007